Linear-Space Data Structures for Range Minority Query in Arrays
نویسندگان
چکیده
منابع مشابه
Low Space Data Structures for Geometric Range Mode Query
Let S be a set of n points in an [n] grid, such that each point is assigned a color. Given a query range Q = [a1, b1] × [a2, b2] × . . . × [ad, bd], the geometric range mode query problem asks to report the most frequent color (i.e., a mode) of the multiset of colors corresponding to points in S ∩ Q. When d = 1, Chan et al. (STACS 2012 [2]) gave a data structure that requires O(n + (n/∆)/w) wor...
متن کاملData Structures for Reporting Extension Violations in a Query Range
Design Rule Checking (DRC) in VLSI design involves checking if a given VLSI layout satisfies a given set of rules, and reporting the violations if any. We propose data structures for reporting violations of the minimum extension rule in a query window of
متن کاملA Simple Linear-Space Data Structure for Constant-Time Range Minimum Query
We revisit the range minimum query problem and present a new O(n)-space data structure that supports queries in O(1) time. Although previous data structures exist whose asymptotic bounds match ours, our goal is to introduce a new solution that is simple, intuitive, and practical without increasing asymptotic costs for query time or space.
متن کاملSpace Efficient Data Structures for Dynamic Orthogonal Range Counting
We present a linear-space data structure that maintains a dynamic set of n points with coordinates of real numbers on the plane to support orthogonal range counting, as well as insertions and deletions, in O(( lgn lg lgn )) time. This provides faster support for updates than previous results with the same bounds on space cost and query time. We also obtain two other new results by considering t...
متن کاملBetter Space Bounds for Parameterized Range Majority and Minority
Karpinski and Nekrich (2008) introduced the problem of parameterized range majority, which asks to preprocess a string of length n such that, given the endpoints of a range, one can quickly find all the distinct elements whose relative frequencies in that range are more than a threshold τ . Subsequent authors have reduced their time and space bounds such that, when τ is given at preprocessing t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2014
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-014-9881-9